https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:13149 n+1=(a_n+b_n)/2 and b_n+1 = [formula could not be replicated] with a_o:=1 and b_o:=x. The common limit is ₂F₁(½,½;1;1−x²)^-1 and the convergence is quadratic. This is a rare object with very few close relatives. There are however three other hypergeometric functions for which we expect similar iterations to exist, namely:₂F₁(½−s₁,½ + s; 1;·) with s=1/3, 1/4, 1/6. Our intention is to exhibit explicitly these iterations and some of their generalizations. These iterations exist because of underlying quadratic or cubic transformations of certain hypergeometric functions, and thus the problem may be approached via searching for invariances of the corresponding second-order differential equations. It may also be approached by searching for various quadratic and cubic modular equations for the modular forms that arise on inverting the ratios of the solutions of these differential equations. In either case, the problem is intrinsically computational. Indeed, the discovery of the identities and their proofs can be effected almost entirely computationally with the aid of a symbolic manipulation package, and we intend to emphasize this computational approach.]]> Sat 24 Mar 2018 08:18:08 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:13123 Sat 24 Mar 2018 08:15:04 AEDT ]]>